Computer and Modernization ›› 2012, Vol. 203 ›› Issue (7): 17-20.doi: 10.3969/j.issn.1006-2475.2012.07.005

• 算法设计与分析 • Previous Articles     Next Articles

A New Parallel Selfbalancing PSO Algorithm with Data Integer Programming

FANG Xin   

  1. Department of Electronic and Information Engineering, Ankang University, Ankang 725000, China
  • Received:2012-02-28 Revised:1900-01-01 Online:2012-08-10 Published:2012-08-10

Abstract: To effectively solve the problem of the standard particle swarm (PSO) algorithm, which is the lack of diversity and not high accuracy, this paper uses multi-core systems and actual universities geographic coordinates. Then it gives an integer programming and parallel selfbalancing PSO algorithm to solving university path. Self-balancing mechanism uses parallel processing of multicore systems to generate independent sub-groups. Every sub-group can do parallel computation and finally generate the optimal path of the main group. It uses C++ programming in Visual Studio 2005 .NET to realize simulation. The results show that this algorithm improves the performance of the PSO algorithm from the solution accuracy and computation time which are two important aspects.

Key words: parallel processing, parallel self-balancing PSO algorithm, university path

CLC Number: